DNA Sequence Alignment Algorithm Based on k-tuple Statistics
نویسندگان
چکیده
منابع مشابه
Document for : K 2 and K ∗ 2 : efficient alignment - free sequence similarity measurements based on the Kendall statistics
Supplementary Document for: K2 and K∗ 2 : efficient alignment-free sequence similarity measurements based on the Kendall statistics Jie Lin 1, Donald A. Adjeroh 2, Bing-Hua Jiang 3 and Yue Jiang 1∗ 1 College of Mathematics and Informatics, Fujian Normal University, Fuzhou 350108, China. 2 Department of Computer Science & Elect. Engineering, West Virginia University, Morgantown, WV 26506, USA. 3...
متن کاملMultiple DNA Sequence Alignment Based on Genetic Simulated Annealing Techniques
Multiple DNA sequence alignment is an important research topic of bioinformatics. In this paper, we present a new method for multiple DNA sequence alignment, based on genetic simulated annealing techniques, to choose the best cutting point set of the multiple DNA sequence set. The experimental results show that the proposed method gets higher scores and more match columns than the method presen...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملA local algorithm for DNA sequence alignment with inversions.
A dynamic programming algorithm to find all optimal alignments of DNA subsequences is described. The alignments use not only substitutions, insertions and deletions of nucleotides but also inversions (reversed complements) of substrings of the sequences. The inversion alignments themselves contain substitutions, insertions and deletions of nucleotides. We study the problem of alignment with non...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/smce2017/12455